A FIFO bu er with real - time interface

نویسندگان

  • A. Yakovlev
  • D. J. Kinniment
  • F. Xia
چکیده

The design of a FIFO buuer with fully asynchronous, non-blocking write and read operation is presented. The buuer's logic consists of a standard self-timed FIFO (e.g. pipeline) surrounded by two special interface blocks, In and Out, connected to Writer and Reader, respectively. To avoid temporal blocking of Writer requesting for a write when the pipeline is full the In block implements skipping of the data item. Similarly, if Reader attempts to read an empty pipe, to avoid its blocking, a special acknowledge signal is produced telling Reader to re-read the previous item. These blocks are synthe-sised from their Signal Transition Graph (STG) speciications using an asynchronous circuit synthesis tool, petrify. The proposed solution is compared and contrasted against a previously known four-slot mechanism.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cv - Sdf - a Synchronous Data Flow Model for Real - Time Computer Vision Applications Technical Areas : Image Analysis and Real - Time Software

This paper presents a model for real-time computer vision applications based on the synchronous data ow (SDF) methodology. To accomplish the needs of computer vision applications (mainly access to pixel neighborhood and access to previous video frames) a new bu er concept called Structured Bu ers replace the FIFO bu ers used in the SDF model. The model minimizes the system's latency and memory ...

متن کامل

Providing Rate Guarantees to TCP over the ATM GFR Service

The ATM Guaranteed Frame Rate (GFR) service is intended for best e ort tra c that can bene t from minimum throughput guarantees. Edge devices connecting LANs to an ATM network can use GFR to transport multiple TCP/IP connections over a single GFR VC. These devices would typically multiplex VCs into a single FIFO queue. It has been shown that in general, FIFO queuing is not su cient to provide r...

متن کامل

A buffer minimization problem for the design of embedded systems

We consider a set of n tasks, each of them is composed by a set of sequential operations. A set of bu ers B is given : each bu er b 2 B is de ned between two tasks Ti ! Tj , has a weight wb and is managed as a FIFO structure. Some operations from Ti write data in the bu er b, other from Tj get data in b. The writings and readings on bu ers generate precedence constraints between the operations....

متن کامل

A Loss Model for VBR Sources in ATM Networks

A variable bit rate source is modeled as a Markov modulated deterministic uid ow (MMDFF) process. Each state in the stationary discrete time Markov chain represents one of a nite number of deterministic messages of xed lengths and variable bit rates. At the user network interface this sequence is served at a constant bit rate with a bu er of xed length. The combined system forms a regenerative ...

متن کامل

EÆcient Pure-bu er Algorithms for Real-time Systems

We present several wait-free algorithms for implementing read/write bu ers in real-time systems. Such bu ers are commonly used in situations where newly-produced data values take precedence over older data, and hence older data can be overwritten. Each of our algorithms is a \pure-bu er" algorithm. In a purebu er algorithm, several bu ers are shared between the writer and reader processes, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998